-
1 terminating algorithm
Большой англо-русский и русско-английский словарь > terminating algorithm
-
2 terminating algorithm
Математика: конечный алгоритм -
3 terminating algorithm
мат.English-Russian scientific dictionary > terminating algorithm
-
4 algorithm
-
5 terminating
1) заканчивающийся
2) конечный
3) завершенный
4) обрывающийся
5) оканчивающийся ∙ terminating [termination] game ≈ заканчивающаяся игра terminating power meter ≈ ваттметр поглощаемой мощности vector terminating at A ≈ вектор с концом в точке A - terminating algorithm - terminating decimal - terminating fraction - terminating office - terminating process ЗавершениеБольшой англо-русский и русско-английский словарь > terminating
См. также в других словарях:
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Markov algorithm — In theoretical computer science, a Markov algorithm is a string rewriting system that uses grammar like rules to operate on strings of symbols. Markov algorithms have been shown to be Turing complete, which means that they are suitable as a… … Wikipedia
Criss-cross algorithm — This article is about an algorithm for mathematical optimization. For the naming of chemicals, see crisscross method. The criss cross algorithm visits all 8 corners of the Klee–Minty cube in the worst case. It visits 3 additional… … Wikipedia
Genetic algorithm — A genetic algorithm (GA) is a search heuristic that mimics the process of natural evolution. This heuristic is routinely used to generate useful solutions to optimization and search problems. Genetic algorithms belong to the larger class of… … Wikipedia
Anytime algorithm — Introduction Most algorithms run to completion: they provide a single answer after performing some fixed amount of computation. In some cases, however, the user may wish to terminate the algorithm prior to completion. The amount of the… … Wikipedia
Dijkstra–Scholten algorithm — The Dijkstra–Scholten algorithm (named after Edsger W. Dijkstra and C. S. Scholten) is an algorithm for detecting termination in a distributed system. The algorithm was proposed by Dijkstra and Scholten in 1980. First, let us consider the case of … Wikipedia
Dijkstra-Scholten algorithm — The Dijkstra Scholten algorithm is an algorithm for detecting termination in a distributed system. The algorithm was proposed by Dijkstra and Scholten in 1980.First, let us consider the case of a simple process graph which is a tree. A… … Wikipedia
BRST algorithm — Boender Rinnooy Stougie Timmer algorithm (BRST) is an optimization algorithm suitable for finding global optimum of black box functions. In their paper Boender et al cite journal | author = Boender, C.G.E., A.H.G. Rinnooy Kan, L. Strougie and G.T … Wikipedia
Genetic programming — In artificial intelligence, genetic programming (GP) is an evolutionary algorithm based methodology inspired by biological evolution to find computer programs that perform a user defined task. It is a specialization of genetic algorithms where… … Wikipedia
Computable number — In mathematics, particularly theoretical computer science and mathematical logic, the computable numbers, also known as the recursive numbers or the computable reals, are the real numbers that can be computed to within any desired precision by a… … Wikipedia
Number — For other uses, see Numbers (disambiguation). A number is a mathematical object used to count and measure. In mathematics, the definition of number has been extended over the years to include such numbers as zero, negative numbers, rational… … Wikipedia